Constraint based implementation of a PDDL-like language with static causal laws and time fluents
نویسندگان
چکیده
Planning Domain Definition Language (PDDL) is the most used language to encode and solve planning problems. In this paper we propose two PDDL-like languages that extend PDDL with new constructs such as static causal laws and time fluents with the aim of improving the expressivity of PDDL language. We study the complexity of the main computational problems related to the planning problem in the new languages. Finally, we implement a planning solver using constraint programming in GECODE that outperforms the existing solvers for similar languages.
منابع مشابه
Planning with Numeric Timed Initial Fluents
Numeric Timed Initial Fluents represent a new feature in PDDL that extends the concept of Timed Initial Literals to numeric fluents. They are particularly useful to model independent functions that change through time and influence the actions to be applied. Although they are very useful to model real world problems, they are not systematically defined in the family of PDDL languages and they a...
متن کاملBoosting Search Guidance in Problems with Semantic Attachments
Most applications of planning to real problems involve complex and often non-linear equations, including matrix operations. PDDL is ill-suited to express such calculations since it only allows basic operations between numeric fluents. To remedy this restriction, a generic PDDL planner can be connected to a specialised advisor, which equips the planner with the ability to carry out sophisticated...
متن کاملDescribing Additive Fluents in Action Language
An additive fluent is a fluent with numerical values such that the effect of several concurrently executed actions on it can be computed by adding the effects of the individual actions. We propose a method for describing effects of actions on additive fluents in the declarative language C+. An implementation of this language, called the Causal Calculator, can be used for the automation of examp...
متن کاملCausal Laws and Multi-Valued Fluents
This paper continues the line of work on representing properties of actions in nonmonotonic formalisms that stresses the distinction between being true and being caused, as in the system of causal logic introduced by McCain and Turner and in the action language C proposed by Giunchiglia and Lifschitz. The only fluents directly representable in language C are truth-valued fluents, which is often...
متن کاملTADA : Transition Aligned Domain Analysis
In this paper we introduce a planner called TADA (Transition Aligned Domain Analysis). TADA is a heuristic temporal and net benefit planner that enables planning with multivalued fluents. These multi-valued fluents, known in the language definition as object-fluents, are an addition to the existing fragment of PDDL timed to coincide with the sixth edition of the International Planning Competiti...
متن کامل